New space-time coding techniques with bit interleaved coded modulations

pour toute la sympathie qu'ils ont offert pendant mes séjours en Bretagne. Je remercie tous lescolì egues et amis du département COMELEC de l'ENST :Danì ele, Marc Fossorier de l'Université d'Hawaii, Emanuele Viterbo du Politecnico di Torino pour toutes les discussions techniques fructueuses et motivantes, et pour leur soutien inconditionnel. Bien ´ evidemment, je remercie toute l'´ equipe des thésards et stagiaires de différents horizons qui ont réussì a me supporter pendant trois ans et ont partagé leur richesse culturelle. Un grand mercì a (aléatoirement, comme on en a l'habitude dans le domaine) A mes parents età Christelle. v Thesis abstract This thesis report describes new designs for transmitters and receivers of bit-interleaved coded modulations over multiple antenna channels. The objective is to achieve near Shannon capacity performance over ergodic channels and near outage probability performance over block fading channels. Iterative joint detection and decoding are applied in the aim of achieving near maximum likelihood performance. Design criteria are derived for each block optimization from the error performance expressions under the ideal interleaving assumption. First, we describe the binary mapping optimization for ergodic channels by introducing the new concept of mul-tidimensional mapping that provides large amount of coding gain. We achieve near capacity performance either with turbo-codes or with multi-dimensional mappings associated with a simple code. Then, we present the bit-interleaved coded modulation with linear precoding as a Space-Time code for multiple antenna block fading channels. We show that the channel inter-leaver is the fundamental part of the bit-interleaved coded modulation calling the shots about the achieved diversity. We describe the linear precoding optimality condition and a class of quasi-optimal linear precoders. The minimal linear precoder size providing full diversity is deduced from a modified Singleton bound applied to the global Euclidean code. We show that full diversity and quasi-optimal coding gains are observed for a given error correcting code. Finally, we achieve near outage capacity performance thanks to turbo-codes. Next, iterative joint detection and decoding techniques are considered, we describe a near optimum soft-input soft-output list sphere decoder which allows the computation of a posteriori probabilities for very high spectral efficiency transmitter schemes with reduced complexity.